1383. Maximum Performance of a Team.go

package leetcode

import (
"container/heap"
"sort"
)

funcmaxPerformance(nint, speed []int, efficiency []int, kint) int {
indexes:=make([]int, n)
fori:=rangeindexes {
indexes[i] =i
 }
sort.Slice(indexes, func(i, jint) bool {
returnefficiency[indexes[i]] >efficiency[indexes[j]]
 })
ph:=speedHeap{}
heap.Init(&ph)
speedSum:=0
varmaxint64
for_, index:=rangeindexes {
ifph.Len() ==k {
speedSum-=heap.Pop(&ph).(int)
 }
speedSum+=speed[index]
heap.Push(&ph, speed[index])
max=Max(max, int64(speedSum)*int64(efficiency[index]))
 }
returnint(max% (1e9+7))
}

typespeedHeap []int

func (hspeedHeap) Less(i, jint) bool { returnh[i] <h[j] }
func (hspeedHeap) Swap(i, jint) { h[i], h[j] =h[j], h[i] }
func (hspeedHeap) Len() int { returnlen(h) }
func (h*speedHeap) Push(xinterface{}) { *h=append(*h, x.(int)) }
func (h*speedHeap) Pop() interface{} {
res:= (*h)[len(*h)-1]
*h= (*h)[:h.Len()-1]
returnres
}

funcMax(a, bint64) int64 {
ifa>b {
returna
 }
returnb
}